Providing Near Per-Flow Scheduling in Commodity Switches Without Per-Flow Queues

نویسندگان

چکیده

Network quality of service (QoS) is essential for network applications. For many applications, getting a fair share available bandwidth their flows can prevent them from being blocked by other that do not respond to congestion. Providing per-flow scheduling in each output port commodity switch isolate the compete bottleneck link. Although maintain shares among competing flows, due high implementation costs providing queues switches, this capability rarely provided switches on market. To address need, we design and implement near-per-flow scheme named Near Per-flow Scheduling (NPFS) P4 programmable hardware evaluate its performance. NPFS provides effectiveness have ports. utilizes priority most dynamically assigns these based protocol types current sending rates. Experimental results show that, when number less than three times queues, guarantees achieved bandwidths only deviate ideal 5%.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Providing Guaranteed Services Without Per Flow

Previous proposals for providing guaranteed services require routers to manage per ow states and perform per ow operations, which raises scalability concerns for both the data and control planes of the core network infrastructure. To achieve scalability, several recent proposals, mainly in the context of the IETF diiserv working group, use an implementation architecture in which only edge route...

متن کامل

Per-flow Queuing Memory Management without Per-flow Queues in High Speed Routers

Packet buffering in high speed routers requires a memory management unit to maintain the structure of the queues. With the dramatic increase in link speed and number of traffic flows, per-flow queuing becomes more and more challenging for the memory management unit since millions of queues should be maintained. To address this issue, a scheme called Dynamic Queue Sharing (DQS) is proposed in th...

متن کامل

Achieving per-flow Queueing Performance without a per-flow Queue

Recent studies have shown that suitably-designed packet discard policies can dramatically improve the performance of fair queueing mechanisms in internet routers. The Queue State Deficit Round Robin algorithm (QSDRR) preferentially discards from long queues, but introduces hysteresis into the discard policy to minimize synchronization among TCP flows. QSDRR provides higher throughput and much b...

متن کامل

Providing Quality of Service Guarantees without Per-Flow State

Two approaches have been proposed to improve the quality of service provided by the Internet: integrated services and differentiated services. Integrated services requires perflow state at each router. On the other hand, differentiated services does not require per-flow state, but provides a lower level of quality of service. We present a protocol which provides quality of service similar to th...

متن کامل

Fair , Efficient and Scalable Scheduling Without Per - Flow State ∗

In recent years, parallel computer systems are being increasingly used in multi-user environments, with several users sharing the interconnection network at the same time. As a result a large number frequently contend for link bandwidth at the core switches in the network. Traditional fair scheduling disciplines need to maintain per-flow states and perform packet scheduling on a per-flow basis,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3281699